Series-parallel orientations preserving the cycle-radius

Let G be an undirected 2-edge connected graph with nonnegative edge weights and a distinguished vertex z. For every node consider a shortest cycle containing this node and z in G. The cycle-radius of G is the maximum length of a cycle in this set. Let H be a directed graph obtained by directing the edges of G. The cycle-radius of H is similarly defined except that cycles are replaced by directed closed walks. We prove that there exists for every nonnegative edge weight function an orientation H of G whose cycle-radius equals that of G if and only if G is series-parallel.